Depth-Based Image Registration
نویسندگان
چکیده
Image registration is a fundamental task in computer vision because it can significantly contribute to high-level computer vision and benefit numerous practical applications. Though a lot of image registration techniques exist in literature, there is still a significant amount of research to be conducted because there are a lot of issues that need to be solved such as the parallax problem. The traditional image registration algorithms suffer from the parallax problem due to their underling assumption that the scene can be regarded approximately planar which is not satisfied in the case of large depth variation in the images with high-rise objects. With regard to the the parallax problem, a new strategy is proposed by leveraging the depth information via 3D reconstruction. One novel idea is to recover the depth in the image region with high-rise objects to build accurate transform function for image registration. Our method mitigates the parallax problem and can achieve robust registration results, which is validated by our experiments. Our algorithm is attractive to numerous practical applications.
منابع مشابه
Contourlet-Based Edge Extraction for Image Registration
Image registration is a crucial step in most image processing tasks for which the final result is achieved from a combination of various resources. In general, the majority of registration methods consist of the following four steps: feature extraction, feature matching, transform modeling, and finally image resampling. As the accuracy of a registration process is highly dependent to the fe...
متن کاملA Novel Subsampling Method for 3D Multimodality Medical Image Registration Based on Mutual Information
Mutual information (MI) is a widely used similarity metric for multimodality image registration. However, it involves an extremely high computational time especially when it is applied to volume images. Moreover, its robustness is affected by existence of local maxima. The multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...
متن کاملA Study on Robustness of Various Deformable Image Registration Algorithms on Image Reconstruction Using 4DCT Thoracic Images
Background: Medical image interpolation is recently introduced as a helpful tool to obtain further information via initial available images taken by tomography systems. To do this, deformable image registration algorithms are mainly utilized to perform image interpolation using tomography images.Materials and Methods: In this work, 4DCT thoracic images of five real patients provided by DI...
متن کاملRegistration of Depth Image and Color Image Based on Harris-SIFT
In the recent past, it has become a widely accepted and applied method to recognize and localize objects based on local point features. However, the existing approaches are based on matching color images. With the widely use of Kinect, the registration between depth image and color image becomes necessary and important. To effectively match 3D depth images and 2D color images and estimate the t...
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملSurface reconstruction of detect contours for medical image registration purpose
Although, most of the abnormal structures of human brain do not alter the shape of outer envelope of brain (surface), some abnormalities can deform the surface extensively. However, this may be a major problem in a surface-based registration technique, since two nearly identical surfaces are required for surface fitting process. A type of verification known as the circularity check for th...
متن کامل